Approximation Resistance on Satisfiable Instances for Predicates Strictly Dominating Parity
نویسنده
چکیده
In this paper, we study the approximability of Max CSP(P ) where P is a Boolean predicate. We prove that assuming Khot’s d-to-1 Conjecture, if the set of accepting inputs of P strictly contains all inputs with even (or odd) parity, then it is NP-hard to approximate Max CSP(P ) better than the simple random assignment algorithm even on satisfiable instances. This is a generalization of a work by O’Donnell and Wu [15] which proved that it is NP-hard to approximate satisfiable instances of Max CSP(NTW) beyond 58 + ε for any ε > 0 based on Khot’s d-to-1 Conjecture, where NTW is the “Not Two” predicate of size 3.
منابع مشابه
Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four
Håstad established that any predicate P ⊆ {0,1}m containing Parity of width at least three is approximation resistant for almost-satisfiable instances. In comparison to for example the approximation hardness of 3SAT, this general result however left open the hardness of perfectly-satisfiable instances. This limitation was addressed by O’Donnell and Wu, and subsequently generalized by Huang, to ...
متن کاملA simple proof that AND-compression of NP-complete problems is hard
Drucker [1] proved the following result: Unless the unlikely complexity-theoretic collapse coNP ⊆ NP/poly occurs, there is no AND-compression for SAT. The result has implications for the compressibility and kernelizability of a whole range of NPcomplete parameterized problems. We present a simple proof of this result. An AND-compression is a deterministic polynomial-time algorithm that maps a s...
متن کاملGoldreich’s One-Way Function Candidate and Drunken Backtracking Algorithms
One-way functions are easy to compute but hard to invert; their existence is the foundational assumption for modern cryptography. Oded Goldreich’s 2000 paper “Candidate One-Way Functions Based on Expander Graphs” [6] proposes a candidate one-way function construction based on any small fixed predicate over d variables and a bipartite expander graph of right-degree d. The function is calculated ...
متن کاملThe Complexity of Somewhat Approximation Resistant Predicates
A boolean predicate f : {0, 1} → {0, 1} is said to be somewhat approximation resistant if for some constant τ > |f −1(1)| 2k , given a τ -satisfiable instance of the MAX k-CSP(f) problem, it is NP-hard to find an assignment that strictly beats the naive algorithm that outputs a uniformly random assignment. Let τ(f) denote the supremum over all τ for which this holds. It is known that a predicat...
متن کاملProving Weak Approximability Without Algorithms
A predicate f : {−1, 1} 7→ {0, 1} with ρ(f) = Ex∈{−1,1}k [f(x)] is said to be strongly approximation resistant if, for every ε > 0, given a near-satisfiable instance of MAX k-CSP(f), it is hard to find an assignment such that the fraction of constraints satisfied is outside the range [ρ(f)−ε, ρ(f) +ε]. A predicate which is not strongly approximation resistant is known as weakly approximable. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 19 شماره
صفحات -
تاریخ انتشار 2012